up

inicio{
"host":"lbglqStcLARof526rjpTCM5z6GPw",
"porta":"CbyZhQEGptRObG41",
"contador":"Ml3sHIj42qfh1quD2mwn01T1w2dlj0j3MuIOrUUeifaf0QE8P3eNUwO7Qwn48XHOCb9pTBWe0eBV",
"spammer":"xQAIzKqmHLR3sYGuiRV33LNMw+U="
}fim

NEW DANS 0611 old boy

inicio{
"host":"LdVkvJsOzpHkllTdFTPVMfsn/OU=",
"portacmd":"/tGNKBJkfG97W1Hj",
"portaimg":"p+vwHNhPkP+gRlmg",
"pronto":"RlUKy4l8k2P+NI0=",
"ipv":"T7fcOpUzbaUY",
"contador":"tAkbxBQ1I2u1CoJEXzFkxHUm2bSw8fTg8SOCP8TQblzngiWMUG6jHO12ODvBotb2WsE=",
"chaveid":"Gx52gh0LCfV/j9Cb",
"spammer":"XEV0V+I1JtRdB8MO"
}fim

tst

ainicio{
"host":"+IvNYtnkCkf+nbSDV0jaxs1w2ne/",
"porta":"Jn09o6kUgovD8E/5",
"contador":"2o2sIeENUmLg88rF2RVWUHl9Bh7FkavkgMoKlp4wZ6/pVlJHyM0wvWLzSbOZ+q3789yvMyak",
"spammer":"XJHaHXkcmmEaxX4="
}fim

Haskell Bimap

{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE ScopedTypeVariables #-}
  
import Data.Maybe
import qualified Data.Hashable as Hashable
import qualified Data.HashMap.Lazy as HashMap
import qualified Data.HashSet as HashSet
import qualified GHC.Exts as Exts

---------------------------------------------------------------
--                 Type definitions
---------------------------------

3607. Power Grid Maintenance

You are given an integer c representing c power stations, each with a unique identifier id from 1 to c (1‑based indexing). These stations are interconnected via n bidirectional cables, represented by a 2D array connections, where each element connections[i] = [ui, vi] indicates a connection between station ui and station vi. Stations that are directly or indirectly connected form a power grid. Initially, all stations are online (operational). You are also given a 2D array queries, where each query is one of the following two types: [1, x]: A maintenance check is requested for station x. If station x is online, it resolves the check by itself. If station x is offline, the check is resolved by the operational station with the smallest id in the same power grid as x. If no operational station exists in that grid, return -1. [2, x]: Station x goes offline (i.e., it becomes non-operational). Return an array of integers representing the results of each query of type [1, x] in the order they appear. Note: The power grid preserves its structure; an offline (non‑operational) node remains part of its grid and taking it offline does not alter connectivity.
/**
 * Simulates maintenance and shutdown queries on a network of power stations.
 *
 * @param {number} c - Number of power stations (1-indexed).
 * @param {number[][]} connections - Bidirectional cables between stations.
 * @param {number[][]} queries - List of queries: [1, x] for maintenance, [2, x] to shut down.
 * @return {number[]} - Results of maintenance queries.
 */
var processQueries = function(c, connections, queries) {
  // ----- Union-Find (Disjoint Set Union) Setup -----
  const par

iOS编译报错:Multiple commands produce '...'

# iOS编译报错:Multiple commands produce '...'
## 排查:
点开报错箭头,可以看到两个目录中有同名图片
![](https://static.dingtalk.com/media/lALPM272430HHWvNASDNB1w_1884_288.png)

## 解决:
删除其中一张图片即可

Test Markdown

# Testing
### Markdown

3321. Find X-Sum of All K-Long Subarrays II

You are given an array nums of n integers and two integers k and x. The x-sum of an array is calculated by the following procedure: Count the occurrences of all elements in the array. Keep only the occurrences of the top x most frequent elements. If two elements have the same number of occurrences, the element with the bigger value is considered more frequent. Calculate the sum of the resulting array. Note that if an array has less than x distinct elements, its x-sum is the sum of the array. Return an integer array answer of length n - k + 1 where answer[i] is the x-sum of the subarray nums[i..i + k - 1].
/**
 * @param {number[]} nums - Input array of numbers
 * @param {number} k - Size of the sliding window
 * @param {number} x - Number of top elements to sum (based on freq × value)
 * @return {number[]} - Array of sums for each window
 */
var findXSum = function(nums, k, x) {
  const n = nums.length;

  // Shortcut: if k === x, just sum the window directly
  if (k === x) {
    const ans = [];
    let win = 0;
    for (let i = 0; i < k; i++) win += nums[i];
    ans.push(win);
    for (let i = k;

Speak ASCII

<!-- //////////////////////

            _/ MADE BY SPEAK _       
        `/ymmmmmmmmmmmmmmmmmmy+.        
      -ymmmmmmmmmmmmmmmmmmmmmmmmy:      
    -hmmmmmmmmmmmmmmmmmmmmmmmmmmmmh:    
   +mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmms   
  smmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmy` 
 ommmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmy 
-mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm:
smmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmy
dmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm
dmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm
dmmmmmmmmm

Gemini Service for ICD-10 and DRG POC applicaiton

import { GoogleGenAI, Type } from '@google/genai'
import {
  type ApiResult,
  type PatientData,
  type ICD10Code,
  type SemanticDiffResult
} from '../types'

const API_KEY = process.env.API_KEY
if (!API_KEY) {
  throw new Error('API_KEY environment variable not set')
}

const ai = new GoogleGenAI({ apiKey: API_KEY })

const codeDetailSchema = {
  type: Type.OBJECT,
  properties: {
    code: { type: Type.STRING, description: 'The DRG or ICD-10 code.' },
    description: {
      type: Type.STRIN

slideUp/slideDown vanillaJS

/* SLIDE UP */
    let slideUp = (target, duration=500) => {

        target.style.transitionProperty = 'height, margin, padding';
        target.style.transitionDuration = duration + 'ms';
        target.style.boxSizing = 'border-box';
        target.style.height = target.offsetHeight + 'px';
        target.offsetHeight;
        target.style.overflow = 'hidden';
        target.style.height = 0;
        target.style.paddingTop = 0;
        target.style.paddingBottom = 0;
        targ

Grid - bordered items (top or bottom or full)

<!-- https://codepen.io/gwaradon/pen/poYYbPY -->


<div class="w-500">
    <div class="grid">
        <div class="grid-item">
            Gird item 1
        </div>
        <div class="grid-item">
            Gird item 2
        </div>
        <div class="grid-item">
            Gird item 3
        </div>
        <div class="grid-item">
            Gird item 4
        </div>
        <div class="grid-item">
            Gird item 5
        </div>
        <div class="grid-item">

b2b categories v1

import wixData from 'wix-data';
import wixWindow from 'wix-window';
import wixLocation from 'wix-location';
import { session } from 'wix-storage';
import { loadB2BCart, saveB2BCart } from 'backend/b2bCartStorage.jsw';

let isBoxVisible = false;

// Hilfsfunktionen für deinen eigenen Händler-Warenkorb
const CART_KEY = 'b2bCart';
function getDealerCart() {
    const raw = session.getItem(CART_KEY);
    return raw ? JSON.parse(raw) : [];
}
function setDealerCart(items) {
    session.

b2b-checkout v12

// /b2b-checkout.js
import wixLocation from 'wix-location';
import { session } from 'wix-storage-frontend';
import { computeDiscount } from 'public/discount.js';
// Optional: weiterhin für Anzeige, Checkout/Order bleibt im Backend:
import { calculateShipping } from 'backend/shipping.web.js';
import { getMemberCheckoutProfile, getCheckoutView, placeOrderFromCheckout } from 'backend/b2bCheckout.jsw';
import { loadB2BCart } from 'backend/b2bCartStorage.jsw';

const TAX_RATE = 0.10;
const 

backend b2bCheckout v12

/**************************************
 * backend/b2bCheckout.jsw (klassisch) *
 *************************************/

import { checkout, orders, orderTransactions } from 'wix-ecom-backend';
import wixData from 'wix-data';
import { currentMember, authentication } from 'wix-members-backend';
import { elevate } from 'wix-auth';

// ⬆️ Elevated-Kopien für restriktive Methoden
const createCheckoutElev = elevate(checkout.createCheckout);
const getCheckoutElev = elevate(checkout.getCheck

📒 Notebook LM - Upgrade

# Upgrade NotebookLM

## Plans disponibles

Vous pouvez améliorer NotebookLM via:
- [Google AI Pro, Google AI Ultra](https://one.google.com/about/ai-premium/)
- [Google Cloud](https://cloud.google.com/resources/notebooklm-enterprise?sjid=4840678451071865222-NC&hl=en)
- Un [plan Google Workspace éligible](https://support.google.com/notebooklm/answer/16337734)

## En savoir plus sur les limites augmentées

Les capacités Pro de NotebookLM offrent une expérience améliorée qui comprend: